The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
p(s(x)) → x
f(s(x), s(y), s(z)) → f(max(s(x), max(s(y), s(z))), p(min(s(x), max(s(y), s(z)))), min(s(x), min(s(y), s(z))))
f(0, y, z) → max(y, z)
f(x, 0, z) → max(x, z)
f(x, y, 0) → max(x, y)

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

min(0', y) → 0'
min(x, 0') → 0'
min(s(x), s(y)) → s(min(x, y))
max(0', y) → y
max(x, 0') → x
max(s(x), s(y)) → s(max(x, y))
p(s(x)) → x
f(s(x), s(y), s(z)) → f(max(s(x), max(s(y), s(z))), p(min(s(x), max(s(y), s(z)))), min(s(x), min(s(y), s(z))))
f(0', y, z) → max(y, z)
f(x, 0', z) → max(x, z)
f(x, y, 0') → max(x, y)

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
min(0', y) → 0'
min(x, 0') → 0'
min(s(x), s(y)) → s(min(x, y))
max(0', y) → y
max(x, 0') → x
max(s(x), s(y)) → s(max(x, y))
p(s(x)) → x
f(s(x), s(y), s(z)) → f(max(s(x), max(s(y), s(z))), p(min(s(x), max(s(y), s(z)))), min(s(x), min(s(y), s(z))))
f(0', y, z) → max(y, z)
f(x, 0', z) → max(x, z)
f(x, y, 0') → max(x, y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
p :: 0':s → 0':s
f :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
min, max, f

They will be analysed ascendingly in the following order:
min < f
max < f

(6) Obligation:

Innermost TRS:
Rules:
min(0', y) → 0'
min(x, 0') → 0'
min(s(x), s(y)) → s(min(x, y))
max(0', y) → y
max(x, 0') → x
max(s(x), s(y)) → s(max(x, y))
p(s(x)) → x
f(s(x), s(y), s(z)) → f(max(s(x), max(s(y), s(z))), p(min(s(x), max(s(y), s(z)))), min(s(x), min(s(y), s(z))))
f(0', y, z) → max(y, z)
f(x, 0', z) → max(x, z)
f(x, y, 0') → max(x, y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
p :: 0':s → 0':s
f :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
min, max, f

They will be analysed ascendingly in the following order:
min < f
max < f

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Induction Base:
min(gen_0':s2_0(0), gen_0':s2_0(0)) →_R^Ω(1)
0'

Induction Step:
min(gen_0':s2_0(+(n4_0, 1)), gen_0':s2_0(+(n4_0, 1))) →_R^Ω(1)
s(min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0))) →_IH
s(gen_0':s2_0(c5_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
min(0', y) → 0'
min(x, 0') → 0'
min(s(x), s(y)) → s(min(x, y))
max(0', y) → y
max(x, 0') → x
max(s(x), s(y)) → s(max(x, y))
p(s(x)) → x
f(s(x), s(y), s(z)) → f(max(s(x), max(s(y), s(z))), p(min(s(x), max(s(y), s(z)))), min(s(x), min(s(y), s(z))))
f(0', y, z) → max(y, z)
f(x, 0', z) → max(x, z)
f(x, y, 0') → max(x, y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
p :: 0':s → 0':s
f :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
max, f

They will be analysed ascendingly in the following order:
max < f

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n389₀)

Induction Base:
max(gen_0':s2_0(0), gen_0':s2_0(0)) →_R^Ω(1)
gen_0':s2_0(0)

Induction Step:
max(gen_0':s2_0(+(n389_0, 1)), gen_0':s2_0(+(n389_0, 1))) →_R^Ω(1)
s(max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0))) →_IH
s(gen_0':s2_0(c390_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(11) Complex Obligation (BEST)

(12) Obligation:

Innermost TRS:
Rules:
min(0', y) → 0'
min(x, 0') → 0'
min(s(x), s(y)) → s(min(x, y))
max(0', y) → y
max(x, 0') → x
max(s(x), s(y)) → s(max(x, y))
p(s(x)) → x
f(s(x), s(y), s(z)) → f(max(s(x), max(s(y), s(z))), p(min(s(x), max(s(y), s(z)))), min(s(x), min(s(y), s(z))))
f(0', y, z) → max(y, z)
f(x, 0', z) → max(x, z)
f(x, y, 0') → max(x, y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
p :: 0':s → 0':s
f :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n389₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
f

(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol f.

(14) Obligation:

Innermost TRS:
Rules:
min(0', y) → 0'
min(x, 0') → 0'
min(s(x), s(y)) → s(min(x, y))
max(0', y) → y
max(x, 0') → x
max(s(x), s(y)) → s(max(x, y))
p(s(x)) → x
f(s(x), s(y), s(z)) → f(max(s(x), max(s(y), s(z))), p(min(s(x), max(s(y), s(z)))), min(s(x), min(s(y), s(z))))
f(0', y, z) → max(y, z)
f(x, 0', z) → max(x, z)
f(x, y, 0') → max(x, y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
p :: 0':s → 0':s
f :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n389₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

(16) BOUNDS(n^1, INF)

(17) Obligation:

Innermost TRS:
Rules:
min(0', y) → 0'
min(x, 0') → 0'
min(s(x), s(y)) → s(min(x, y))
max(0', y) → y
max(x, 0') → x
max(s(x), s(y)) → s(max(x, y))
p(s(x)) → x
f(s(x), s(y), s(z)) → f(max(s(x), max(s(y), s(z))), p(min(s(x), max(s(y), s(z)))), min(s(x), min(s(y), s(z))))
f(0', y, z) → max(y, z)
f(x, 0', z) → max(x, z)
f(x, y, 0') → max(x, y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
p :: 0':s → 0':s
f :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n389₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(18) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

(19) BOUNDS(n^1, INF)

(20) Obligation:

Innermost TRS:
Rules:
min(0', y) → 0'
min(x, 0') → 0'
min(s(x), s(y)) → s(min(x, y))
max(0', y) → y
max(x, 0') → x
max(s(x), s(y)) → s(max(x, y))
p(s(x)) → x
f(s(x), s(y), s(z)) → f(max(s(x), max(s(y), s(z))), p(min(s(x), max(s(y), s(z)))), min(s(x), min(s(y), s(z))))
f(0', y, z) → max(y, z)
f(x, 0', z) → max(x, z)
f(x, y, 0') → max(x, y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
p :: 0':s → 0':s
f :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

(22) BOUNDS(n^1, INF)